from math import sqrt


def dfs(x, y):
    if dx > d:
        return 0


for i in range(1, n + 1):
    for j in range(2):
        mp[]

if  # 向量值大于1
    print(1)

n = int(input())
a = [''] * n
for i in range(n): a[i] = list(input().split())
mp = [[' '] * 2 for i in range(n + 1)]
d = int(input())
for x in range(n):
    mp[int(x) + 1][0], mp[int(x) + 1][1] = a[x][0], a[x][1]
# dfs(sx,sy)
print(a)
print(mp)‘’
